Parallel Simulated Annealing Algorithms

n different nodes of the network. The two algorithms have been applied to the job shop scheduling problem (JSS) and the traveling salesman problem (TSP). Both algorithms showed very good performance in terms of solution time and solution quality. The rest of the paper is organized in the following fashion. Section II describes the simulated annealing technique. Section III presents the cluster algorithm. Section IV presents the genetic cluster algorithm. Section V gives implementations of both the algorithms on a network of Sun workstations. Section VI deals with the application and performance studies of the algorithms to the cases of JSS and TSP.